Hamiltonicity of 3-connected line graphs
نویسندگان
چکیده
Thomassen conjectured that every 4-connected line graph is Hamiltonian. Lai et al. conjectured [H. Lai, Y. Shao, H. Wu, J. Zhou, Every 3-connected, essentially 11-connected line graph is Hamiltonian, J. Combin. Theory Ser. B 96 (2006) 571–576] that every 3-connected, essentially 4-connected line graph is Hamiltonian. In this note, we first show that the conjecture posed by Lai et al. is not true and there is an infinite family of counterexamples;we show that 3-connected, essentially 4-connected line graph of a graph with at most 9 vertices of degree 3 is Hamiltonian; examples show that all conditions are sharp. © 2012 Elsevier Ltd. All rights reserved.
منابع مشابه
Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
In this paper, we consider forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs. Let Zi be the graph obtaind from a triangle by attaching a path of length i to one of its vertices, and let Q∗ be the graph obtained from the Petersen graph by adding one pendant edge to each vertex. Lai et al. [J. Graph Theory 64 (2010), no. 1, 1-11] conjectured that every 3-connected {K1,3, Z9}-f...
متن کاملK-ordered Hamiltonicity of Iterated Line Graphs
A graph G of order n is k-ordered hamiltonian, 2 ≤ k ≤ n, if for every sequence v1, v2, . . . , vk of k distinct vertices of G, there exists a hamiltonian cycle that encounters v1, v2, . . . , vk in this order. In this paper, we generalize two well-known theorems of Chartrand on hamiltonicity of iterated line graphs to k-ordered hamiltonicity. We prove that if Ln(G) is k-ordered hamiltonian and...
متن کاملOn 3-connected hamiltonian line graphs
Thomassen conjectured that every 4-connected line graph is hamiltonian. It has been proved that every 4-connected line graph of a claw-free graph, or an almost claw-free graph, or a quasi-claw-free graph, is hamiltonian. In 1998, Ainouche et al. [2] introduced the class of DCT graphs, which properly contains both the almost claw-free graphs and the quasi-claw-free graphs. Recently, Broersma and...
متن کاملOn a Closure Concept in Claw-Free Graphs
If G is a claw-free graph, then there is a graph cl(G) such that (i) G is a spanning subgraph of cl(G), (ii) cl(G) is a line graph of a triangle-free graph, and (iii) the length of a longest cycle in G and in cl(G) is the same. A suucient condition for hamiltonicity in claw-free graphs, the equivalence of some conjectures on hamiltonicity in 2-tough graphs and the hamiltonicity of 7-connected c...
متن کاملHamiltonicity and forbidden subgraphs in 4-connected graphs
Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3, 1, 1, 1, 1, 1), i.e. T is a chain of three triangles. We show that every 4-connected {T,K1,3}-free graph has a hamiltonian cycle.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 158 شماره
صفحات -
تاریخ انتشار 2010